Monte Carlo computer investigations of higher generation ideal dendrimers

Computational Higher Order Quasi-Monte Carlo Integration

The efficient construction of higher-order interlaced polynomial lattice rules introduced recently in [6] is considered and the computational performance of these higher-order QMC rules is investigated on a suite of parametric, highdimensional test integrand functions. After reviewing the principles of their construction by the “fast component-by-component” (CBC) algorithm due to Nuyens and Coo...

Monte-Carlo methods for Computer Vision

In figure 1, suppose we are throwing darts to each of the Cartesian systems. The probability of a dart falling anywhere in the red area is easy to compute when we are dealing with analytical shapes such as a rectangle or a circle; but how do we compute the probability of success in the third case? One approach is the Riemann integration method by separating the whole system into a thin grid and...

Monte Carlo investigations of phase transitions: status and perspectives

Using the concept of finite-size scaling, Monte Carlo calculations of various models have become a very useful tool for the study of critical phenomena, with the system linear dimension as a variable. As an example, several recent studies of Ising models are discussed, as well as the extension to models of polymer mixtures and solutions. It is shown that using appropriate cluster algorithms, ev...

Quasi - Monte Carlo Methods in Computer Graphics

The problem of global illumination in computer graphics is described by a Fredholm integral equation of the second kind. Due to the complexity of this equation, Monte Carlo methods provide an efficient tool for the estimation of the solution. A new approach, using quasi-Monte Carlo integration, is introduced and compared to Monte Carlo integration. We discuss some theoretical aspects and give n...

Monte-Carlo Tree Search and Computer Go